On the extendability of particular classes of constant dimension codes

In classical coding theory, different types of extendability results of codes are known. A classical example is the result stating that every (4, q − 1, 3)-code over an alphabet of order q is extendable to a (4, q, 3)-code. A constant dimension subspace code is a set of (k− 1)-spaces in the projective space PG(n− 1, q), which pairwise intersect in subspaces of dimension upper bounded by a specific parameter. The theoretical upper bound on the sizes of these constant dimension subspace codes is given by the Johnson bound. This Johnson bound relies on the upper bound on the size of partial s-spreads, i.e., sets of pairwise disjoint s-spaces, in a projective space PG(N, q). When N +1 ≡ 0 (mod s+1), it is possible to partition PG(N, q) into s-spaces, also called s-spreads of PG(N, q). In the finite geometry research, extendability results on large partial s-spreads to s-spreads in PG(N, q) are known when N + 1 ≡ 0 (mod s + 1). This motivates the study to determine similar extendability results on constant dimension subspace codes whose size is very close to the Johnson bound. By developing geometrical arguments, avoiding having to rely on extendability results on partial s-spreads, such extendability results for constant dimension subspace codes are presented.